A Comparison of Parallel Solvers for Diagonally Dominant and General Narrow-Banded Linear Systems II
نویسندگان
چکیده
We continue the comparison of parallel algorithms for solving diagonally dominant and general narrow-banded linear systems of equations that we started in [2]. The solvers compared are the banded system solvers of ScaLAPACK [6] and those investigated by Arbenz and Hegland [1, 5]. We present the numerical experiments that we conducted on the IBM SP/2.
منابع مشابه
A Comparison of Parallel Solvers for Diagonally Dominant and General Narrow-Banded Linear Systems
We investigate and compare stable parallel algorithms for solving diagonally dominant and general narrow-banded linear systems of equations. Narrow-banded means that the bandwidth is very small compared with the matrix order and is typically between 1 and 100. The solvers compared are the banded system solvers of ScaLAPACK [11] and those investigated by Arbenz and Hegland [3, 6]. For the diagon...
متن کاملA parallel hybrid banded system solver: the SPIKE algorithm
This paper describes an efficient and robust hybrid parallel solver ‘‘the SPIKE algorithm’’ for narrow-banded linear systems. Two versions of SPIKE with their built-in-options are described in detail: the Recursive SPIKE version for handling non-diagonally dominant systems and the Truncated SPIKE version for diagonally dominant ones. These SPIKE schemes can be used either as direct solvers, or ...
متن کاملA Note on ScaLAPACK's Banded System Solvers
We suggest modiications in the local computations of the ScaLAPACK subroutines for solving diagonally dominant and arbitrary narrow-banded linear systems. The modiications concern the way auxiliary variables are stored. The numerical properties of the algorithms are not aaected. However, as the way the memory is accessed is changed the performance of the solvers is signiicantly improved. We dis...
متن کاملThe Stable Parallel Solution of Narrow Banded Linear Systems
We report on experiments with a stable algorithm for the parallel solution of banded and periodically banded linear systems. In contrast to most of the known parallel algorithms which are stable only for symmetric positive deenite or diagonally dominant systems, the new algorithm incorporates pivoting without sacriicing eeciency. We report on numerical experiments conducted on an Intel Paragon,...
متن کاملOn some parallel banded system solvers
We consider algorithms for solving narrow-banded diagonally dominant linear systems which are suitable for multiprocessors. We describe a direct solver similar to that in [12] for tridiagonal systems, and in [9] for solving a banded system on a linearly connected set of processors. We will also provide and analyze a parallel implementation of the partitioning algorithm and the matrix decomposit...
متن کامل